Deadlock Avoidance for Switches Based on Wormhole Networks
نویسنده
چکیده
We consider the use of wormhole routed networks as internal interconnects of switches. The interconnection of two wormhole networks that are free from deadlocks does not necessarily produce a deadlock free network. This is problematic when wormhole networks are used as switch-internal fabrics, because it severely restricts the possibilities for coupling the switches together. This paper presents a theory that can be effectively used to control this phenomenon caused by aggregated dependencies. We show that all aggregated dependencies can be removed from wormhole networks by careful inclusion of a limited number of virtual channels.
منابع مشابه
On Con guration of Switch-Based Networks with Wormhole Switching
As switch-based networks have become promising network platforms to build workstation clusters for high performance computing, many types of (expensive) switches have been developed to support high-speed communication. However, their communication performance heavily depends on the connguration of switches and the deadlock problem caused by wormhole switching is another crucial factor in eecien...
متن کاملDeadlock Avoidance for Wormhole Based Switches
This paper considers the architecture of switches. In particular we study how virtual cut-through and wormhole networks can be used as the switch internal interconnect. Introducing such switches into a deadlock free interconnect may give rise to new deadlocks. Previously, to reason that no deadlocks are created, the resulting system was considered globally, that is, the interconnects of the swi...
متن کاملA General Theory for Deadlock Avoidance in Wormhole-Routed Networks
Most machines of the last generation of distributed memory parallel computers possess speci c routers which are used to exchange messages between non-neighboring nodes in the network. Among the several technologies, wormhole routing is usually prefered because it allows low channel-setup time, and reduces the dependency between latency and inter-node distance. However, wormhole routing is very ...
متن کاملSoftware-Based Deadlock Recovery Technique for True Fully Adaptive Routing in Wormhole Networks
Networks using wormhole switching have traditionally relied upon deadlock avoidance strategies for the design of deadlock-free routing algorithms. More recently, deadlock recovery strategies have begun to gain acceptance. In particular, progressive deadlock recovery techniques are very attractive because they allocate a few dedicated resources to quickly deliver deadlocked packets, instead of k...
متن کاملA Performance Enhanced and Cost Effective Deadlock Recovery Scheme for Adaptive Wormhole Routed Networks
Deadlock free routing of messages is a challenge for the performance of directly connected network systems. Communication among the nodes of a directly connected multicomputer system is via message exchange. The wormhole routing is perceived as the best switching technique in directly connected systems. The technique suffers the challenges like deadlock avoidance. Deadlock recovery faces cost o...
متن کامل